A Scalable Algorithm for Light Computation
نویسندگان
چکیده
Models of forest ecosystems are needed to understand how climate and land-use change impact carbon storage and biodiversity. Light is the primary resource that controls the germination, growth and survival of trees in a forest. However, existing models cannot capture the details of forest light without large sacrifices in efficiency, thus limiting their ability to explore large spatial and temporal domains. In this paper we describe a forest light model based on a novel graphics-processor algorithm that reduces runtime by two orders of magnitude over conventional ray tracing algorithms without sacrificing fine-scale detail in understory light conditions. These algorithms allow us to simulate large landscapes for long periods of time without loss of accuracy. We also present experimental results that compares the uncertainty in our light predictions to the (much larger) inherent variability in the ecological processes driven by understory light, seed germination and seedling growth. Finally, we compare our results to previous attempts to speed up conventional ray tracing models, which are based on reducing the range of zenith angles considered, and find that such approaches consistantly overpredict light in forest gaps and edges, precisely the places where 3D ray tracing models are required over simpler 1D models.
منابع مشابه
Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملPhotodynamic Cancer Therapy Using Wavelet Based Monte Carlo Computation of Light Absorption with a Genetic Algorithm
Objective: The method to treating cancer that combines light and light-sensitive drugs to selectively destroy tumour cells without harming healthy tissue is called photodynamic therapy (PDT). It requires accurate data for light dose distribution, generated with scalable algorithms. One of the benchmark approaches involves Monte Carlo (MC) simulations. This gives an accurate assessment of light ...
متن کاملComplexity-scalable algorithmic design: implementation of a scalable resolution enhancement algorithm
A complexity scalable algorithm is an algorithm that has several computation scales with gracefully degraded qualities from the original quality. In this paper, we present the importance, and the design principle and guideline of making a scalable algorithm. We then use a resolution enhancement algorithm as an example to make it scalable. The resulting scalable algorithm has 5 computation scale...
متن کاملIntelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006